Wrla 2000 Preliminary Version Behavioral and Coinductive Rewriting
نویسندگان
چکیده
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including notions like termination and con uence. We describe an e cient implementation of behavioral rewriting that uses standard rewriting. Circular coinductive rewriting combines behavioral rewriting with circular coinduction, giving a surprisingly powerful proof method for behavioral properties; it is implemented in the BOBJ system, which is used in our examples. These include several lazy functional stream program equivalences and a behavioral re nement.
منابع مشابه
Circular Coinductive Rewriting
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our new BOBJ behavioral specification and computation system, which is used in examples throughout this paper. These examples demonstrate the surprising power of circular coinductive rewriting. The paper also sketches the u...
متن کاملConditional Circular Coinductive Rewriting with Case Analysis
We argue for an algorithmic approach to behavioral proofs, review the hidden algebra approach, develop circular coinductive rewriting for conditional goals, extend it with case analysis, and give some examples.
متن کاملCIRC : A Circular Coinductive Prover
CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, together with a high-level implementation using metalevel capabilities of rewriting logic. To reflect the strength of CIRC in automatically proving behavioral properties, an example defining and proving properties about infinite stre...
متن کاملBehavioral Coinductive Rewriting
Specifying and verifying behavioral properties in addition to strict properties of systems is becoming an appropriate approach to the actual software engineering. The Internet facilitates distributed cooperative projects and implicitly distributed cooperative software systems whose behavior is di cult to catch using only strict equalities of states. At the author's knowledge, coinduction [11, 2...
متن کاملA Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version)
We present a coinductive framework for defining infinitary analogues of equational reasoning and rewriting in a uniform way. We define the relation =, a notion of infinitary equational reasoning, and →∞, the standard notion of infinitary rewriting as follows: = := νR. (=R ∪ R)∗ →∞ := μR. νS. (→R ∪ R)∗ ◦ S where μ and ν are the least and greatest fixed-point operators, respectively, and where R ...
متن کامل